采用ZnO灭磁时阀片均流/均能的探讨

从ZnO电阻的非线性特性出发,对采用ZnO作为灭磁电阻时阀片的均流/均能进行理论论述,指出阀片均能性能的好坏主要依赖于阀片自身的特性;分析比较了ZnO阀片的不同选择方法对均流/均能的影响,指出阀片的均流/均能很大程度上取决于可供选择的阀片的库存量.该研究为发电机励磁系统的安全稳定运行提供了有力的保证.     

Stochastic analysis of file-swarming systems

File swarming (or file sharing) is one of the most important applications in P2P networks. In this paper, we propose a stochastic framework to analyze a file-swarming system under realistic setting: constraints in upload/download capacity, collaboration among peers and incentive for chunk exchange. We first extend the results in the coupon system [L. Massoulie, M. Vojnovic, Coupon replication systems, in: Proc. ACM SIGMETRICS, Banff, Alberta, Canada, 2005] by providing a tighter performance bound. Then we generalize the coupon system by considering peers with limited upload and download capacity. We illustrate the last-piece problem and show the effectiveness of using forward error-correction (FEC) code and/or multiple requests to improve the performance. Lastly, we propose a framework to analyze an incentive-based file-swarming system. The stochastic framework we propose can serve as a basis for other researchers to analyze and design more advanced features of file-swarming systems.     

Threshold cryptography based on Asmuth-Bloom secret sharing

In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosystems. To the best of our knowledge, these are the first provably secure threshold cryptosystems realized using the Asmuth-Bloom secret sharing. Proposed schemes are comparable in performance to earlier proposals in threshold cryptography.     

An empirical investigation of socio-cultural factors of information sharing in China

Understanding information sharing is an important challenge to modern organizations, and is likely to be increasingly considered when IT investment decisions are made world-wide. Our research study investigated the influence of cultural factors on information sharing in China. It was postulated that social network structures such as guanxi, Confucian dynamism, and collectivism could explain the degree to which information sharing took place between people in China. It was found that guanxi, Confucian dynamism, and collectivism all had a significant influence on information sharing.     

理性密钥共享的扩展博弈模型

理性密钥共享体制通过引入惩罚策略使得参与者不会偏离协议,常采用的惩罚是一旦发现有人偏离就立即终止协议.这种惩罚策略有时导致惩罚人自身利益严格受损,从而降低了对被惩罚人的威慑.为了克服这一弱点,本文以扩展博弈为模型分析了理性密钥共享体制.首先给出(2,2)门限的理性密钥共享体制,证明了所给的协议是该博弈的一个序贯均衡,即经过任何历史之后坚持原协议仍然是每一个参与者的最优选择.特别地,在发现有人偏离后,协议所给出的惩罚策略既可以有效惩罚偏离者又能够完全维护惩罚人的利益.这是本文对前人设计的理性密钥共享体制的一个重要改进.然后针对将协议扩展到(t,n)门限情形,实现密钥分发人离线,达到计算的均衡等相关问题给出了一般的解决方案.     

数字水印攻击及对策分析

数字水印技术作为数字媒体版权保护的重要手段越来越引起人们的重视。文章讨论了数字水印的概念、特征,重点介绍了数字水印的鲁棒性及影响数字水印鲁棒性的因素,总结和分析了数字水印主要攻击方式并提出相应的应对措施。     

An oblivious fragile watermarking scheme for images utilizing edge transitions in BTC bitmaps

As one of the famous block-based image coding schemes,block truncation coding(BTC) has been also applied in digital watermarking.Previous BTC-based watermarking or hiding schemes usually embed secret data by modifying the BTC encoding stage or BTC-compressed data,obtaining the watermarked image with poorer quality than the BTC-compressed version.This paper presents a new oblivious image watermarking scheme by exploiting BTC bitmaps.Unlike the traditional schemes,our approach does not really perform the BTC compression on images during the embedding process but utilizes the parity of the number of horizontal edge transitions in each BTC bitmap to guide the watermark embedding and extraction processes.The embedding process starts by partitioning the original cover image into non-overlapping 4×4 blocks and performing BTC on each block to obtain its BTC bitmap.One watermark bit is embedded in each block by modifying at most three pixel values in the block to make sure that the parity of the number of horizontal edge transitions in the bitmap of the modified block is equal to the embedded watermark bit.In the extraction stage,the suspicious image is first partitioned into non-overlapping 4×4 blocks and BTC is performed on each block to obtain its bitmap.Then,by checking the parity of the number of horizontal edge transitions in the bitmap,we can extract one watermark bit in each block.Experimental results demonstrate that the proposed watermarking scheme is fragile to various image processing operations while keeping the transparency very well.     

A robust watermarking algorithm based on QR factorization and DCT using quantization index modulation technique

We propose a robust digital watermarking algorithm for copyright protection.A stable feature is obtained by utilizing QR factorization and discrete cosine transform(DCT) techniques,and a meaningful watermark image is embedded into an image by modifying the stable feature with a quantization index modulation(QIM) method.The combination of QR factorization,DCT,and QIM techniques guarantees the robustness of the algorithm.Furthermore,an embedding location selection method is exploited to select blocks with small modifications as the embedding locations.This can minimize the embedding distortion and greatly improve the imperceptibility of our scheme.Several standard images were tested and the experimental results were compared with those of other published schemes.The results demonstrate that our proposed scheme can achieve not only better imperceptibility,but also stronger robustness against common signal processing operations and lossy compressions,such as filtering,noise addition,scaling,sharpening,rotation,cropping,and JPEG/JPEG2000 compression.     

A multipurpose audio watermarking algorithm with synchronization and encryption

We propose a new multipurpose audio watermarking scheme in which two complementary watermarks are used.For audio copyright protection,the watermark data with copyright information or signature are first encrypted by Arnold transformation.Then the watermark data are inserted in the low frequency largest significant discrete cosine transform(DCT) coefficients to obtain robustness performance.For audio authentication,a chaotic signal is inserted in the high frequency insignificant DCT coefficients to detect tampered regions.Furthermore,the synchronization code is embedded in the audio statistical characteristics to resist desynchronization attacks.Experimental results show that our proposed method can not only obtain satisfactory detection and tampered location,but also achieve imperceptibility and robustness to common signal processing attacks,such as cropping,shifting,and time scale modification(TSM).Comparison results show that our method outperforms some existing methods.